By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Volume 6, Issue 3, pp. 335-521

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Counting Embeddings of Planar Graphs Using DFS Trees

Jiazhen Cai

pp. 335-352

Induced Cycle Structures of the Hyperoctahedral Group

William Y. C. Chen

pp. 353-362

Collisions Among Random Walks on a Graph

Don Coppersmith, Prasad Tetali, and Peter Winkler

pp. 363-374

Minimum Edge Dominating Sets

J. D. Horton and K. Kilakos

pp. 375-387

Reciprocal Sums over Partitions and Compositions

A. Knopfmacher and J. N. Ridley

pp. 388-399

Domination on Cocomparability Graphs

Dieter Kratsch and Lorna Stewart

pp. 400-417

Complexity of the Forwarding Index Problem

Rachid Saad

pp. 418-427

Parity Subgraph, Shortest Cycle Cover, and Postman Tour

Cun-Quan Zhang

pp. 428-431

Complexity Results for POMSET Languages

Joan Feigenbaum, Jeremy A. Kahn, and Carsten Lund

pp. 432-442

An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size

Mark Goldberg and Thomas Spencer

pp. 443-459

Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test

Ming-Yang Kao and Dan Gusfield

pp. 460-476

The Lattice Structure of Flow in Planar Graphs

Samir Khuller, Joseph (Seffi) Naor, and Philip Klein

pp. 477-490

$n + 1$ Segments Beat $n$

Jeno Törocsik

pp. 491-500

Replicating Tessellations

Andrew Vince

pp. 501-521